Manifold Reconstruction Using Tangential Delaunay Complexes
نویسندگان
چکیده
منابع مشابه
Stability and Minimax Optimality of Tangential Delaunay Complexes for Manifold Reconstruction
In this paper we consider the problem of optimality in manifold reconstruction. A random sample Xn = {X1, . . . , Xn} ⊂ R composed of points lying on a d-dimensional submanifold M , with or without outliers drawn in the ambient space, is observed. Based on the Tangential Delaunay Complex [4], we construct an estimator M̂ that is ambient isotopic and Hausdorffclose to M with high probability. The...
متن کاملFeature Extraction of 2-manifold Using Delaunay Triangulation
This paper is dedicated to a proposition of a novel feature extraction method for 2-manifold objects in 3D. The topological description was used as a base of the method. The curvatures of the surface are used to obtain the description independent on the position and the orientation of the object. In the addition, the Morse theory and the Delaunay triangulation are combined together to generate ...
متن کاملManifold Evolution with Tangential Redistribution of Points
In this paper we propose several techniques for tangential redistribution of points on evolving surfaces. This is an important issue in numerical approximation of any Lagrangian evolution model, since the quality of the mesh has a significant impact on the result of the computation. We explain the volume-oriented and length-oriented tangential redistribution methods in a general setting of an m...
متن کاملDelaunay refinement for curved complexes
This work investigates the Delaunay refinement for curved complexes. A manifold complex is defined as an unambiguous representation for the geometric objects required by a partial differential equation solver. The Chew’s and Ruppert’s Delaunay refinement algorithms, including an extension for curved complexes, are described under a new and arbitrary dimensional perspective. A theorem for strong...
متن کاملFast reconstruction of delaunay triangulations
We present a new O(n) algorithm to compute good orders for the point set of a Delaunay triangulation of n points in the plane. Such a good order makes reconstruction in O(n) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld [1], which is based on independent sets, our algorithm uses a breadth rst search (BFS) to obtain these orders. Both approaches ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2013
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-013-9557-2